1991A - Maximize the Last Element - CodeForces Solution


greedy implementation

Please click on ads to support us..

Python Code:

import io,os

input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

t = int(input())

def inp():
    return int(input())
def inlt():
    return list(map(int,input().split()))
def instr():
    return list(input())

for _ in range(t):
    n = inp()
    a = inlt()

    maxe = 0
    for i in range(0,len(a),2):
        maxe = max(maxe,a[i])
    
    print(maxe)


Comments

Submit
0 Comments
More Questions

219A - k-String
952A - Quirky Quantifiers
451B - Sort the Array
1505H - L BREAK into program
171E - MYSTERIOUS LANGUAGE
630D - Hexagons
1690D - Black and White Stripe
1688D - The Enchanted Forest
1674C - Infinite Replacement
712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers
8A - Train and Peter
591A - Wizards' Duel
1703G - Good Key Bad Key
1705A - Mark the Photographer
1707A - Doremy's IQ
1706B - Making Towers
1325B - CopyCopyCopyCopyCopy
1649C - Weird Sum
1324B - Yet Another Palindrome Problem